The Inhabitation Problem for Rank Two Intersection Types
نویسنده
چکیده
We prove that the inhabitation problem for rank two intersection types is decidable, but (contrary to common belief) EXPTIME-hard. The exponential time hardness is shown by reduction from the in-place acceptance problem for alternating Turing machines.
منابع مشابه
Rank 3 Inhabitation of Intersection Types Revisited (Extended Version)
We revisit the undecidability result of rank 3 intersection type inhabitation (Urzyczyn 2009) in pursuit of two goals. First, we strengthen the previous result by showing that intersection type inhabitation is undecidable for types of rank 3 and order 3, i.e. it is not necessary to introduce new functional dependencies (new instructions) during proof search. Second, we pinpoint the principles n...
متن کاملInhabitation of Low-Rank Intersection Types
We prove that the inhabitation problem (“Does there exist a closed term of a given type?”) is undecidable for intersection types of rank 3 and exponential space complete for intersection types of rank 2.
متن کاملInhabitation for Non-idempotent Intersection Types
The inhabitation problem for intersection types in λ-calculus is known to be undecidable. We study the problem in the case of non-idempotent intersection, considering several type assignment systems, which characterize the solvable or the strongly normalizing λ-terms. We prove the decidability of the inhabitation problem for all the systems considered, by providing sound and complete inhabitati...
متن کاملThe Inhabitation Problem for Intersection Types
In the system λ∧ of intersection types, without ω, the problem as to whether an arbitrary type has an inhabitant, has been shown to be undecidable by Urzyczyn in [10]. For one subsystem of λ∧, that lacks the ∧introduction rule, the inhabitation problem has been shown to be decidable in Kurata and Takahashi [9]. The natural question that arises is: What other subsystems of λ∧, have a decidable i...
متن کاملFinite Combinatory Logic with Intersection Types
Combinatory logic is based on modus ponens and a schematic (polymorphic) interpretation of axioms. In this paper we propose to consider expressive combinatory logics under the restriction that axioms are not interpreted schematically but ,,literally”, corresponding to a monomorphic interpretation of types. We thereby arrive at finite combinatory logic, which is strictly finitely axiomatisable a...
متن کامل